Bridget Eileen Tenner
نویسنده
چکیده
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino tilings, modulo 2, and leads to a variety of corollaries, including that the number of domino tilings of a k× 2k rectangle is congruent to 1 mod 4.
منابع مشابه
Optimizing Linear Extensions
The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2 √ n. In a special case, the bound can be improved to √
متن کاملA Non-messing-up Phenomenon for Posets
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along both sets of chains, the labels of the chains in the first set remain sorted. We also characterize posets with more restrictive sorting properties.
متن کاملOn expected factors in reduced decompositions in type B
The expected number of Yang-Baxter moves appearing in a reduced decomposition of the longest element of the Coxeter group of type Bn is computed to be 2− 4/n. For the same element, the expected number of 0101 or 1010 factors appearing in a reduced decomposition is 2/(n − 2).
متن کاملDomino Tiling Congruence Modulo 4
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino tilings, modulo 2, and leads to a variety of corollaries, including that the number of domino tilings of a k× 2k rectangle is congruent to 1 mod 4.
متن کاملOn the expected number of commutations in reduced words
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that nearly all positions in the reduced word are expected to support commutations. Finally, we calculate the asymptotic frequencies of commutations, consecutive n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007